Multicut on Graphs of Bounded Clique-Width
نویسندگان
چکیده
Several variants of Multicut problems arise in applications like circuit and network design. In general, these problems are NP-complete. The goal of our work is to investigate the potential of clique-width for identifying tractable fragments of Multicut. We show for several parameterizations involving clique-width whether they lead to tractability or not. Since bounded tree-width implies bounded clique-width, our tractability results extend previous results via tree-width, in particular to dense graphs.
منابع مشابه
On the complexity of the multicut problem in bounded tree-width graphs and digraphs
Given an edgeor vertex-weighted graph or digraph and a list of source-sink pairs, the minimum multicut problem consists in selecting a minimum weight set of edges or vertices whose removal leaves no path from each source to the corresponding sink. This is a classical NPhard problem, and we show that the edge version becomes tractable in bounded tree-width graphs if the number of source-sink pai...
متن کاملPolynomial-time Algorithm for Isomorphism of Graphs with Clique-width at most 3
The clique-width is a measure of complexity of decomposing graphs into certain tree-like structures. The class of graphs with bounded clique-width contains bounded tree-width graphs. While there are many results on the graph isomorphism problem for bounded treewidth graphs, very little is known about isomorphism of bounded cliquewidth graphs. We give the first polynomial-time graph isomorphism ...
متن کاملA comparison of two approaches for polynomial time algorithms computing basic graph parameters
In this paper we compare and illustrate the algorithmic use of graphs of bounded treewidth and graphs of bounded clique-width. For this purpose we give polynomial time algorithms for computing the four basic graph parameters independence number, clique number, chromatic number, and clique covering number on a given tree structure of graphs of bounded tree-width and graphs of bounded clique-widt...
متن کاملMulticuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
CNRS Paris, France and Department of Computer Science E-mail: [email protected] The Multicut problem can be defined as: given a graph G and a collection of pairs of distinct vertices fsi; tig ofG, find a minimum set of edges ofGwhose removal disconnects each si from the corresponding ti. Multicut is known to be NP-hard and Max SNP-hard even when the input graph is restricted to being a tree. ...
متن کاملMinimal forbidden induced subgraphs of graphs of bounded clique-width and bounded linear clique-width
In the study of full bubble model graphs of bounded clique-width and bounded linear clique-width, we determined complete sets of forbidden induced subgraphs, that are minimal in the class of full bubble model graphs. In this note, we show that (almost all of) these graphs are minimal in the class of all graphs. As a corollary, we can give sets of minimal forbidden induced subgraphs for graphs o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012